home *** CD-ROM | disk | FTP | other *** search
- Path: casbah.acns.nwu.edu!muzaffar
- From: muzaffar@casbah.acns.nwu.edu (Usman Muzaffar)
- Newsgroups: comp.lang.c
- Subject: Re: Finite State Machine
- Date: 1 Apr 1996 12:13:51 GMT
- Organization: Northwestern University, Evanston IL
- Message-ID: <4joh9v$jct@news.acns.nwu.edu>
- References: <8BDC44A.02C7002D6C.uuout@sourcebbs.com>
- NNTP-Posting-Host: casbah.acns.nwu.edu
-
- In article <8BDC44A.02C7002D6C.uuout@sourcebbs.com>,
- DAVID MOHORN <david.mohorn@sourcebbs.com> wrote:
- >Whats a Finite State Machine (FSM)?
- >
-
- First of all, this question has absolutely nothing to do with C,
- so redirect follow-ups to comp.theory whatever.
-
- An FSM is a mathematical construct. Technically, it's an ordered
- quintuple consisting of a set of states, a start state, a transition
- function, an alphabet, and a set of finishing states.
-
- Without getting into all the gory details: it's basically a mathematical
- description of a very, simple computer that is a very useful model
- for studying what kind of problems can be solved and how.
-
- -usman
-
-